Dynamic Concurrency Control while Scheduling Query Mixes

Scheduling Query Mixes: Dynamic Concurrency Control

Distributed Versioning: Consistent Replication for Scaling Back-End Databases of Dynamic Content Web Sites

Dynamic content Web sites consist of a front-end Web server, an application server and a back-end database. In this paper we introduce distributed versioning, a new method for scaling the back-end database through replication. Distributed versioning provides both the consistency guarantees of eager replication and the scaling properties of lazy replication. It does so by combining a novel concu...

Contender: A Resource Modeling Approach for Concurrent Query Performance Prediction

Predicting query performance under concurrency is a difficult task that has many applications in capacity planning, cloud computing, and batch scheduling. We introduce Contender, a new resourcemodeling approach for predicting the concurrent query performance of analytical workloads. Contender’s unique feature is that it can generate effective predictions for both static as well as adhoc or dyna...

Query Interactions in Database Systems

The typical workload in a database system consists of a mix of multiple queries of different types, running concurrently and interacting with each other. The same query may have different performance in different mixes. Hence, optimizing performance requires reasoning about query mixes and their interactions, rather than considering individual queries or query types. In this dissertation, we de...

Optimistic Concurrency Control for Inverted Files in Text Databases

Inverted files are frequently used as index data structures for very large text databases. Most applications of this data structure are for read-only query operations. However, the problem of introducing update operations has deserved little attention so far and yet it has important applications. In this paper we propose an optimistic concurrency control algorithm devised to handle mixes of upd...